Successive Lossy Compression for Laplacian Sources
نویسندگان
چکیده
In this project report, we present three practical schemes of lossy compression for Laplacian source and L-1 distortion: The first scheme generalizes the successive refinement scheme. The second scheme modifies the first scheme by using only ternary alphabet. The third scheme encodes only the indices of maximum and minimum component. The whole of suggested schemes have a rateless property as well as are practical in terms of low complexity and applicability in real image data. Moreover, these also work for a Gaussian source.
منابع مشابه
A bi-level view of inpainting - based image compression
ar X iv :1 40 1. 41 12 v1 [ cs .C V ] 1 6 Ja n 20 14 Abstract Inpainting based image compression approaches, especially linear and non-linear diffusion models, are an active research topic for lossy image compression. The major challenge in these compression models is to find a small set of descriptive supporting points, which allow for an accurate reconstruction of the original image. It turns...
متن کاملCUDA-Accelerated HD-ODETLAP: Lossy High Dimensional Gridded Data Compression
We present High-dimensional Overdetermined Laplacian Partial Differential Equations (HD-ODETLAP), a high dimensional lossy compression algorithm and CUDA implementation that exploits data correlations across multiple dimensions of gridded GIS data. Exploiting the GPU gives a considerable speedup. In addition, HD-ODETLAP compresses much better than JPEG2000 and 3D-SPIHT, when fixing either the a...
متن کاملNon-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems
In this paper, we revisit two multi-terminal lossy source coding problems: the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994), and the multiple description coding problem with one semi-deterministic distortion measure, which we refer to as the Fu-Yeung problem (Fu and Yeung, 2002). For the ...
متن کاملSimple Compression Algorithm for Memoryless Laplacian Source Based on the Optimal Companding Technique
This paper has two achievements. The first aim of this paper is optimization of the lossy compression coder realized as companding quantizer with optimal compression law. This optimization is achieved by optimizing maximal amplitude for that optimal companding quantizer for Laplacian source. Approximate expression in closed form for optimal maximal amplitude is found. Although this expression i...
متن کاملA Minimum Description Length Proposal for Lossy Data Compression
We give a development of the theory of lossy data compression from the point of view of statistics. This is partly motivated by the enormous success of the statistical approach in lossless compression, in particular Rissanen’s celebrated Minimum Description Length (MDL) principle. A precise characterization of the fundamental limits of compression performance is given, for arbitrary data source...
متن کامل